全文获取类型
收费全文 | 195篇 |
免费 | 71篇 |
国内免费 | 14篇 |
出版年
2023年 | 5篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2020年 | 8篇 |
2019年 | 6篇 |
2018年 | 5篇 |
2017年 | 18篇 |
2016年 | 19篇 |
2015年 | 14篇 |
2014年 | 24篇 |
2013年 | 17篇 |
2012年 | 23篇 |
2011年 | 17篇 |
2010年 | 11篇 |
2009年 | 18篇 |
2008年 | 13篇 |
2007年 | 17篇 |
2006年 | 13篇 |
2005年 | 7篇 |
2004年 | 6篇 |
2003年 | 5篇 |
2002年 | 6篇 |
2001年 | 5篇 |
2000年 | 3篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1989年 | 2篇 |
排序方式: 共有280条查询结果,搜索用时 312 毫秒
181.
在协同空战中,快速正确的空战决策是己方战机少受敌方伤害并取得战争胜利的前提。目标与火力资源分配是决策过程的重要部分。多机空战与单机空战相比有明显的不同,不同之处是面临多个敌方目标,根据我方资源最优分配作战对象和火力,基于遗传算法实现了两种算法的有人无人目标与火力资源分配。仿真结果表明,带有毁伤概率门限的算法既节省火力资源又快速有效。 相似文献
182.
183.
针对现有风险分析方法无法较好地描述风险在系统运行过程中的分布情况,提出了面向试验过程的风险分析方法。该方法能够对系统进行全面的描述,并可以给出系统的风险事件分布。在风险识别阶段使用风险分布图和风险事件分析表,使分析人员更容易掌握系统风险分布的全局和细节,最大限度避免风险事件遗漏;在风险管理阶段使用风险分布图,将风险事件与试验过程或作业环节相联系,可以使管理人员和作业人员直观了解系统中风险存在的位置和形式,更有利于风险的控制。该方法使风险分析更接近于试验任务过程实际,更容易为工程技术人员所掌握。 相似文献
184.
185.
This paper examines the discrete equal‐capacity p‐median problem that seeks to locate p new facilities (medians) on a network, each having a given uniform capacity, in order to minimize the sum of distribution costs while satisfying the demand on the network. Such problems arise, for example, in local access and transport area telecommunication network design problems where any number of a set of p facility units can be constructed at the specified candidate sites (hence, the net capacity is an integer multiple of a given unit capacity). We develop various valid inequalities, a separation routine for generating cutting planes that are specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for this class of problems. © 2000 John & Sons, Inc. Naval Research Logistics 47: 166–183, 2000. 相似文献
186.
就人的组队如何解决多任务环境中具有不定性情况下分布式资源管理等问题 ,在微机上采用具有音响—图形功能的 Turbo pascal程序语言 ,建立了一个可以控制的实验环境 ,经分析得出 :在此环境中 ,可以模拟、产生 C3分布系统方面基本的决策制作问题 ,且能充分适应于复杂性的逐步引入 ,可用作建立多人多任务动态决策模型的载体 ,开发组队决策的规范—描述理论。 相似文献
187.
This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms. 相似文献
188.
对软件可靠性分配的遗传模型进行了研究,结合相关知识缩小了基本遗传算法的搜索区域,比较灵活地处理了非线性约束条件,提高了搜索效率,避免了早熟收敛现象.此外,在基本遗传算法中增加了保优操作,从而能够在理论上保证实现分配的最优化.算例表明,该算法十分有效. 相似文献
189.
Capacity providers such as airlines often sell the same capacity to different market segments at different prices to improve their expected revenues. The absence of a secondary market, due to the nontransferability of airline tickets, gives rise to an opportunity for airlines to broker capacity between consumers with different willingness to pay. One way to broker capacity is by the introduction of callable products. The idea is similar to callable bonds where the issuer has the right, but not the obligation, to buy back the bonds at a certain price by a certain date. The idea of callable products was introduced before under the assumption that the fare-class demands are all independent. The independent assumption becomes untenable when there is significant demand recovery (respectively, demand cannibalization) when lower fares are closed (respectively, opened). In this case, consumer choice behavior should be modeled explicitly to make meaningful decisions. In this paper, we consider a general consumer choice model and develop the optimal strategy for callable products. Our numerical study illustrates how callable products are win-win-win, for the capacity provider and for both high and low fare consumers. Our studies also identify conditions for callable products to result in significant improvements in expected revenues. 相似文献
190.